NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
571	Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:23 Complexity classes Mathematical optimization Structural complexity theory Computability theory NP-hard NP-complete Boolean satisfiability problem Cook–Levin theorem P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
572	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
573	Irreducible Triangulations of Surfaces with Boundary∗ Alexandre Boulch† Éric Colin de Verdière‡ Atsuhiro Nakamoto§ Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2013-11-04 07:43:18 NP-complete problems Geometric topology Triangulation Neighbourhood Tree Line graph Graph embedding Edge contraction Matching Graph theory Mathematics Graph operations
574	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, 1 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:16 Polygons NP-complete problems Computational geometry Operations research 3D computer graphics Art gallery problem Simple polygon Travelling salesman problem Visibility Geometry Mathematics Theoretical computer science
575	Model Checking Using SMT and Theory of Lists Aleksandar Milicevic1 and Hillel Kugler2 1 Massachusetts Institute of Technology (MIT), Cambridge, MA, USA Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-02-19 15:58:07 Electronic design automation Formal methods Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories Phase transition Infinite loop FO Theoretical computer science Mathematics Applied mathematics
576	Wireless Netw:27–59 DOIs11276x A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks Radha Poovendran · Loukas Lazos Add to Reading List Source URL: www2.engr.arizona.edu Language: English - Date: 2007-10-10 03:13:37 NP-complete problems Wireless sensor network Distributed data storage Unit disk graph Topology control Routing Graph Topology Connectivity Graph theory Theoretical computer science Mathematics
577	CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 NP-complete problems Algorithm Set cover problem Polynomial Vertex cover Matroid Mathematics Hypergraph Applied mathematics
578	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Chromatic Art Gallery Problem S´ andor P. Fekete∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-21 09:31:52 Theoretical computer science Graph coloring NP-complete problems Art gallery problem Computational geometry Euclidean plane geometry Simple polygon Visibility polygon Area Geometry Mathematics Polygons
579	PDF Document Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-05-29 03:59:19 Constraint programming Logic in computer science Automated theorem proving Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Uninterpreted function Decision problem Theoretical computer science Mathematics Applied mathematics
580	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-01-31 16:33:06 NP-complete problems Analysis of algorithms Parameterized complexity Dominating set Kernelization Vertex cover Path decomposition Tree decomposition Time complexity Theoretical computer science Computational complexity theory Graph theory

UPDATE